|
FEXP Solver
1.0.0.0
|
It contains algorithm for building of a kd-tree data structure and it also process range queries. More...
#include <FEXPTopologieKDTree.h>
Public Member Functions | |
| CFEXPTopologieKDTree (size_t dimension) | |
| virtual | ~CFEXPTopologieKDTree () |
| void | CreateTopologyTree (Ptr< ICFEXPDataModelContIntf > container, size_t opt_id) |
| Ptr< std::vector< Ptr< TData > > > | GetNodesFromBoundingBox (const std::vector< TValue > &min_bound, const std::vector< TValue > &max_bound) |
| void | InsertData (Ptr< TData > &data) |
| void | InsertData (std::vector< Ptr< TData >> &data) |
Static Public Member Functions | |
| static Ptr< CFEXPTopologieKDTree< TData, TValue > > | CreateTopologyTreeProgress (Ptr< ICFEXPDataModelContIntf > container, size_t dimension, size_t opt_id, std::string text) |
It contains algorithm for building of a kd-tree data structure and it also process range queries.
| CFEXPTopologieKDTree< TData, TValue >::CFEXPTopologieKDTree | ( | size_t | dimension | ) |
|
inlinevirtual |
| void CFEXPTopologieKDTree< TData, TValue >::CreateTopologyTree | ( | Ptr< ICFEXPDataModelContIntf > | container, |
| size_t | opt_id | ||
| ) |
|
static |
| Ptr< std::vector< Ptr< TData > > > CFEXPTopologieKDTree< TData, TValue >::GetNodesFromBoundingBox | ( | const std::vector< TValue > & | min_bound, |
| const std::vector< TValue > & | max_bound | ||
| ) |
| void CFEXPTopologieKDTree< TData, TValue >::InsertData | ( | Ptr< TData > & | data | ) |
| void CFEXPTopologieKDTree< TData, TValue >::InsertData | ( | std::vector< Ptr< TData >> & | data | ) |